DSM-based variable ordering heuristic for reduced computational effort of symbolic supervisor synthesis
نویسندگان
چکیده
منابع مشابه
A Structure-Based Variable Ordering Heuristic for SAT
We propose a variable ordering heuristic for SAT, which is based on a structural analysis of the SAT problem. We show that when the heuristic is used by a Davis-Putnam SAT solver that employs conflict-directed backtracking, it produces a divide-and-conquer behavior in which the SAT problem is recursively decomposed into smaller problems that are solved independently. We discuss the implications...
متن کاملFinding Bad States during Symbolic Supervisor Synthesis
This paper is about supervisor synthesis, a central issue in solving control problems within the Ramadge-Wonham framework for Discrete Event Systems. As most automata-based methods, this framework is subject to the state explosion problem. The impact of state explosion has been considerably reduced in the area of formal verification through the introduction of symbolic representation techniques...
متن کاملReversible Logic Synthesis Based on Decision Diagram Variable Ordering
Reversible logic synthesis is important for the design of conventional logic systems such as adiabatic logic and also for quantum logic systems since all quantum logic gates are necessarily reversible in nature. A framework is presented that improves reversible logic synthesis by employing a dynamically determined variable order for quantum multiple-valued decision diagrams (QMDD). We demonstra...
متن کاملFORCE: A Fast & Easy-to-Implement Variable-Ordering Heuristic
The MINCE heuristic for variable-ordering [1] can successfully reduce the size of BDDs and accelerate SAT-solving. Applications to reachability analysis have also been successful [12]. The main drawback of MINCE is its implementation complexity the authors used a pre-existing min-cut placer [6] that is several times larger than any existing SAT solver. Tweaking MINCE is difficult. In this work ...
متن کاملTwo Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2021.04.058